Parallel Algorithms for Solving Linear Systems with Block-Fivediagonal Matrices on Multi-Core CPU
نویسندگان
چکیده
For solving systems of linear algebraic equations with blockfivediagonal matrices arising in geoelectrics and diffusion problems, the parallel matrix square root method, conjugate gradient method with preconditioner, conjugate gradient method with regularization, and parallel matrix sweep algorithm are proposed and some of them are implemented numerically on multi-core CPU Intel. Investigation of efficiency and optimization of parallel algorithms for solving the problem with quasi-model data are performed. The problem with quasi-model data is solved.
منابع مشابه
An Efficient Out-of-core Implementation of Block Cholesky Decomposition on a Multi-gpu System
The Cholesky decomposition is one of the most efficient preconditioners to iterative schemes for solving linear systems such as the conjugate gradient method. However, we are often faced with situations where a linear system exceeds the capacity of existing memory. In this paper we present an efficient out-of-core implementation of the block Cholesky decomposition on a multi-GPU system, which w...
متن کاملSolving a large scale radiosity problem on GPU-based parallel computers
The radiosity equation has been usedwidely in computer graphics and thermal engineering applications. The equation is simple to formulate but is challenging to solve when the number of Lambertian surfaces associatedwith an application becomes large. In this paper, we present the algorithms to compute the view factors and solve the set of radiosity equations using an out-of-core Cholesky decompo...
متن کاملParallel direct methods for solving the system of linear equations with pipelining on a multicore using OpenMP
Recent developments in high performance computer architecture have a significant effect on all fields of scientific computing. Linear algebra and especially the solution of linear systems of equations lie at the heart of many applications in scientific computing. This paper describes and analyzes three parallel versions of the dense direct methods such as the Gaussian elimination method and the...
متن کاملNEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS
We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...
متن کاملCharacterization of Intel Xeon Phi for Linear Algebra Workloads
This study focuses on applicability of Intel Xeon Phi coprocessor for some of the Basic Linear Algebra Subprograms (BLAS) subroutines. Based on Many Integrated Core (MIC) architecture, the vector processing unit (VPU) in Xeon Phi coprocessor provides data parallelism at a very fine grain, working on 512 bits of 16 single-precision floats or 32-bit integers at a time. In our work we analyze how ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016